Improved Synthesis of Clifford+T Quantum Functionality
نویسندگان
چکیده
The Clifford+T library provides robust and fault-tolerant realizations for quantum computations. Consequently, (logic) synthesis of Clifford+T quantum circuits became an important research problem. However, previously proposed solutions are either only applicable to very small quantum systems or lead to circuits that are far from being optimal— mainly caused by a local, i.e. column-wise, consideration of the underlying transformation matrix to be synthesized. In this paper, we suggest an improved approach that considers the matrix globally and, by this, overcomes many of these drawbacks. Preliminary evaluations show the promises of this direction.
منابع مشابه
Clifford Wavelets and Clifford-valued MRAs
In this paper using the Clifford algebra over R4 and its matrix representation, we construct Clifford scaling functions and Clifford wavelets. Then we compute related mask functions and filters, which arise in many applications such as quantum mechanics.
متن کاملEfficient synthesis of probabilistic quantum circuits with fallback
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of T gates of about 1/3 of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+T gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into prot...
متن کاملSynthesis of unitaries with Clifford+T circuits
Implementing a unitary operation using a universal gate set is a fundamental problem in quantum computing. The problem naturally arises when we want to implement some quantum algorithm on a fault tolerant quantum computer. Most fault tolerant protocols allow one to implement only Clifford circuits (those generated by CNOT, Hadamard and Phase gates). To achieve universal quantum computation one ...
متن کاملFast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring Z[ 1 √ 2 , i], in the single-qubit case. We report an efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used. We conjecture that the equivalence of the sets of unitaries implementabl...
متن کاملA framework for exact synthesis
Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find asymptotically optimal approximations in probabilistic polynomial time, in some cases even finding the optimal solution in probabilistic polynomial time given access to an oracle for factoring integers. In this paper...
متن کامل